queueing time

См. также в других словарях:

• Queueing theory — is the mathematical study of waiting lines (or s ). The theory enables mathematical analysis of several related processes, including arriving at the (back of the) queue, waiting in the queue (essentially a storage process), and being served by… …   Wikipedia

• Queueing model — In queueing theory, a queueing model is used to approximate a real queueing situation or system, so the queueing behaviour can be analysed mathematically. Queueing models allow a number of useful steady state performance measures to be determined …   Wikipedia

• Queueing delay — In computer engineering, a queueing delay is the time a job waits in a queue until it can be executed. This term is most often used in reference to routers. When packets arrive at a router, they have to be processed and transmitted. A router can… …   Wikipedia

• Continuous-time Markov process — In probability theory, a continuous time Markov process is a stochastic process { X(t) : t ≥ 0 } that satisfies the Markov property and takes values from a set called the state space; it is the continuous time version of a Markov chain. The… …   Wikipedia

• Jackson's theorem (queueing theory) — Jackson s theorem is the first significant development in the theory of networks of queues. It assumes an open queueing network of single server queues with the following characteristics:* M = # of queues in the system, not counting queue 0 which …   Wikipedia

• Seek time — Die Zugriffszeit ist neben der Schreib und Leserate ein wichtiges Leistungsmaß von Speicherlaufwerken wie Festplatten und optischen Laufwerken oder anderen Speichermedien sowie dem Arbeitsspeicher. Sie umfasst die Zeitspanne zwischen dem… …   Deutsch Wikipedia

• Birth-death process — The birth death process is a special case of Continuous time Markov process where the states represent the current size of a population and where the transitions are limited to births and deaths. Birth death processes have many application in… …   Wikipedia

• Markov chain — A simple two state Markov chain. A Markov chain, named for Andrey Markov, is a mathematical system that undergoes transitions from one state to another, between a finite or countable number of possible states. It is a random process characterized …   Wikipedia

• Dreamworld — For other uses, see Dreamworld (disambiguation). Dreamworld Location Coomera, Queensland, Australia …   Wikipedia

• Matrix scheme — A matrix scheme (also known as a matrix sale or site, and as a hellevator, escavator or ladder scheme) is a business model involving the exchange of money for a certain product with a side bonus of being added to a waiting list for a product of… …   Wikipedia

• Network congestion — In data networking and queueing theory, network congestion occurs when a link or node is carrying so much data that its quality of service deteriorates. Typical effects include queueing delay, packet loss or the blocking of new connections. A… …   Wikipedia